Handling Knowledge Imperfection in Hybrid Logic Inference
نویسندگان
چکیده
منابع مشابه
Deep Inference for Hybrid Logic
This paper describes work in progress on using deep inference for designing a deductive system for hybrid logic. We will see a cut-free system and prove its soundness and completeness. An immediate observation about the system is that there is no need for additional rewrite rules as in Blackburn’s tableaux, nor substitution rules as in Seligman’s sequent system.
متن کاملHandling Imprecise Knowledge with Fuzzy Description Logic
Fuzzy Description Logics have been proposed in the literature as a way to represent and reason with vague and imprecise knowledge. Their decidability, the empirically tractable and efficient reasoning algorithms, that carry over to fuzzy Description Logics, have attracted the attention of many research communities and domains that deal with a wealth of imprecise knowledge and information. In th...
متن کاملManagement of Knowledge Imperfection in Building Intelligent Systems
Where you can find the management of knowledge imperfection in building intelligent systems easily? Is it in the book store? On-line book store? are you sure? Keep in mind that you will find the book in this site. This book is very referred for you because it gives not only the experience but also lesson. The lessons are very valuable to serve for you, that's not about who are reading this mana...
متن کاملKnowledge Extraction and Joint Inference Using Tractable Markov Logic
The development of knowledge base creation systems has mainly focused on information extraction without considering how to effectively reason over their databases of facts. One reason for this is that the inference required to learn a probabilistic knowledge base from text at any realistic scale is intractable. In this paper, we propose formulating the joint problem of fact extraction and proba...
متن کاملException Handling in Logic Programming
One of the long-standing problems on logic programming is to express exception handling in a high-level way. We argue that this problem can be solved by adopting computability logic and sequential-choice disjunctive goal formulas of the form G0 ▽ G1 where G0, G1 are goals. These goals have the following intended semantics: sequentially choose the first true goal Gi and execute Gi where i(= 0 or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2016
ISSN: 1877-0509
DOI: 10.1016/j.procs.2016.08.104